When the constraint of unique labeling is removed , the ordered labeled tree becomes the objective 當(dāng)取消了標(biāo)號(hào)唯一性限定后,論文解決了有序標(biāo)號(hào)樹(shù)中的模式發(fā)現(xiàn)問(wèn)題。
The algorithm transforms the traditional tree - to - tree correction into the comparing of the key trees , which are substantially label trees without duplicate paths . thus , the algorithm achieves high efficiency with the complexity of o ( n ) , where n is the total number of nodes in the trees , which is significant to the large scaled applications 為適應(yīng)大規(guī)模應(yīng)用的需要,本文提出了直接利用特征路徑進(jìn)行文檔比較的kf - diff +算法,同時(shí)適于有序和無(wú)序兩種模式,在時(shí)間復(fù)雜度上從先前的o ( nlogn )提高到o ( n ) ,更加適合internet規(guī)模的應(yīng)用。